Acyclic modal logic: an exercise in irreflexivization

نویسنده

  • Tadeusz Litak
چکیده

Given a unimodal logic Λ extending the modal logic of reflexive frames T = K⊕2p→ p (the symbol ⊕ is used in the same way as in [3]), we can define several irreflexive or non-reflexive counterparts of Λ. Our first approach will be semantical. As usual, given a set W , define ∆W := {〈x, x〉 | x ∈W}. Definition 1.1 The irreflexivization of a frame F = 〈W,R〉 is 〈W,R〉• := 〈W,R − ∆W 〉. For X a class of frames, X• := {F• | F ∈ X}. The irreflexive counterpart of Λ, Λ• := Log(Mod•(Λ)) is the logic determined by irreflexivizations of frames for Λ.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Suhrawardi's Modal Syllogisms

Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...

متن کامل

A PSpace Tableau Algorithm for Acyclic Modalized ALC

We study ALCK_m, which extends the description logic ALC by adding modal operators of the basic multimodal logic K_m. We develop a sound and complete tableau algorithm Lambda_K for answering ALCK_m queries w.r.t. an ALCK_m knowledge base with an acyclic TBox. Defining tableau expansion rules in the presence of acyclic definitions by considering only the concept names on the left-hand side of TB...

متن کامل

PSpace Tableau Algorithms for Acyclic Modalized ALC

We study ALCKm and ALCS4m, which extend the description logic ALC by adding modal operators of the basic multi-modal logics Km and S4m. We develop a sound and complete tableau algorithm ΛK for answering ALCKm queries w.r.t. an ALCKm knowledge base with an acyclic TBox. Defining tableau expansion rules in the presence of acyclic definitions by considering only the concept names on the left-hand ...

متن کامل

XPath and Modal Logics of Finite DAG's

XPath, CTL and the modal logics proposed by Blackburn et al, Palm and Kracht are variable free formalisms to describe and reason about (finite) trees. XPath expressions evaluated at the root of a tree correspond to existential positive modal formulas. The models of XPath expressions are finite ordered trees, or in the presence of XML’s ID/IDREF mechanism graphs. The ID/IDREF mechanism can be se...

متن کامل

Asynchronous Distributed Automata: A Characterization of the Modal Mu-Fragment

We establish the equivalence between a class of asynchronous distributed automata and a small fragment of least fixpoint logic, when restricted to finite directed graphs. More specifically, the logic we consider is (a variant of) the fragment of the modal μ-calculus that allows least fixpoints but forbids greatest fixpoints. The corresponding automaton model uses a network of identical finite-s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007